Rand-FaSE: fast approximate subgraph census
نویسندگان
چکیده
منابع مشابه
Approximate Constrained Subgraph Matching
Our goal is to build a declarative framework for approximate graph matching where various constraints can be stated upon the pattern graph, enabling approximate constrained subgraph matching, extending models and constraints proposed by Rudolf [1] and Valiente et al. [2]. In the present work, we propose a CSP approach for approximate subgraph matching where the potential approximation is declar...
متن کاملLarge Scale Graph Representations for Subgraph Census
A Subgraph Census (determining the frequency of smaller subgraphs in a network) is an important computational task at the heart of several graph mining algorithms. Recently, several efficient algorithms have been described. We focus on the g-tries, a data structure that encapsulates the topology of the smaller subgraphs in order to speed up the overall computation. Its algorithm makes extensive...
متن کاملApproximate Subgraph Isomorphism for Image Localization
We propose a system for user-aided image localization in urban regions by exploiting the inherent graph like structure of urban streets, buildings and intersections. In this graph the nodes represent buildings, intersections and roads. The edges represent “logical links” such as two buildings being next to each other, or a building being on a road. We generate this graph automatically for large...
متن کاملApproximate Max k-Cut with Subgraph Guarantee
We study the following variant of the Max k Cut problem Given an input graph G with positively weighted edges and k colors the number k being xed and not dependent on the input instance we wish to compute a subgraph H of G containing lots of heavy edges and a color assignment c V k such that a all edges in H are properly colored and b a large fraction of edges in G nH is properly colored We giv...
متن کاملREAFUM: Representative Approximate Frequent Subgraph Mining
Noisy graph data and pattern variations are two thorny problems faced by mining frequent subgraphs. Traditional exact-matching based methods, however, only generate patterns that have enough perfect matches in the graph database. As a result, a pattern may either remain undetected or be reported as multiple (almost identical) patterns if it manifests slightly different instances in different gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Network Analysis and Mining
سال: 2015
ISSN: 1869-5450,1869-5469
DOI: 10.1007/s13278-015-0256-2